Lecture : Supplies, Demands, and Pseudoflows [sp'''] .. Reduction to Maximum Flow
نویسندگان
چکیده
In this note, we consider a mild generalization of flows, which allow a fixed amount of flow to be injected or extracted from the flow network at the vertices. For the moment, consider a flow network G = (V, E) without identified source and target vertices. Let b : V → R be a balance function describing how much flow should be injected (if the value is positive) or extracted (if the value is negative) at each vertex. We interpret positive balances as demand or deficit and negative balances as (negated) supply or excess. We now redefine the word flow to mean a function f : E → R that satisfies the modified balance condition ∑
منابع مشابه
Finding a feasible flow in a strongly connected network
We consider the problem of finding a feasible single-commodity flow in a strongly connected network with fixed supplies and demands, provided that the sum of supplies equals the sum of demands and the minimum arc capacity is at least this sum. A fast algorithm for this problem improves the worst-case time bound of the Goldberg-Rao maximum flow method[3] by a constant factor. Erlebach and Hageru...
متن کاملPush-relabel based algorithms for the maximum transversal problem
We investigate the push-relabel algorithm for solving the problem of finding a maximum cardinality matching in a bipartite graph in the context of the maximum transversal problem. We describe in detail an optimized yet easyto-implement version of the algorithm and fine-tune its parameters. We also introduce new performance-enhancing techniques. On a wide range of realworld instances, we compare...
متن کاملAlgorithms for Solving the Independent. Flow Problems
Given a capacitated network with the entrance· vertex set VI and the exit-vertex set V2 on which polymatroids are defmed, an independent flow is a flow in the network such that a vector corresponding to the supplies in VI and a vector corresponding to the demands in V2 are, respectively, independent vectors of the polymatroids on VI and V2 • The independent-flow problems considered in the prese...
متن کاملThe Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
We introduce the pseudoflow algorithm for the maximum-flow problem that employs only pseudoflows and does not generate flows explicitly. The algorithm solves directly a problem equivalent to the minimum-cut problem—the maximum blocking-cut problem. Once the maximum blocking-cut solution is available, the additional complexity required to find the respective maximum-flow is O m logn . A variant ...
متن کاملOn the Relation of Flow Cuts and Irreducible Infeasible Subsystems
Infeasible network flow problems with supplies and demands can be characterized via violated cut-inequalities of the classical Gale-Hoffman theorem. Written as a linear program, irreducible infeasible subsystems (IISs) provide a different means of infeasibility characterization. In this article, we answer a question left open in the literature, by showing a one-to-one correspondence between IIS...
متن کامل